package days48;

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class day39 {
    public static void main1(String[] args) {
        // 循环处理多组测试用例
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            String m = sc.next();
            String n = sc.next();
            System.out.println(LCS(m, n));
        }
    }

    private static int LCS(String m, String n) {
        int a = m.length();
        int b = n.length();
        int arr[][] = new int[a+1][b+1];
        for (int i = 1; i < a+1; i++) {
            for (int j = 1; j < b+1; j++) {
                if(m.charAt(i-1)==n.charAt(j-1)){
                    arr[i][j] = arr[i-1][j-1] + 1;
                }else {
                    arr[i][j] = Math.max(arr[i-1][j],arr[i][j-1]);
                }
            }
        }
        return arr[a][b];
    }


    public static void main2(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            String str1 = scanner.next();
            String str2 = scanner.next();
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(process(str1, str2, a, b));
        }
    }

    private static int process(String str1, String str2, int len1, int len2) {
        char[] ch1 = str1.toCharArray();
        char[] ch2 = str2.toCharArray();
        long res = 0;
        for (int i = len1; i <= len2; i++) {
            char a = ch1[0];
            char b = ch2[0];
            res += (long) Math.pow(26, i - 1) * (b - a);
            long suma = 0;
            long sumb = 0;
            for (int j = 1; j < ch1.length; j++)// 找到比ch1剩余字符串小的字符串个数
            {
                suma = suma + (ch1[j] - 'a') * (long) Math.pow(26, i - 1 - j);
            }
            for (int j = 1; j < ch2.length; j++)// 找到比ch2剩余字符串小的字符串个数
            {
                sumb = sumb + (ch2[j] - 'a') * (long) Math.pow(26, i - 1 - j);
            }
            res = res + sumb - suma;
        }
        res--;
        res= res % 1000007;
        return (int) res;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] arr = new int[5];
        for (int i = 0; i < 5; i++) {
            arr[i] = scanner.nextInt();
        }
        if(arr[2] == 0){
            System.out.println(1);
            return;
        }
        int[][] load = new int[arr[0]][arr[1]];

    }
}
